Partition signed social networks via clustering dynamics
نویسندگان
چکیده
Inspired by the dynamics phenomenon occurred in social networks, the WJJLGS model is modified to imitate the clustering dynamics of signed social networks. Analyses show that the clustering dynamics of the model can be applied to partition signed social networks. Traditionally, blockmodel is applied to partition signed networks. In this paper, a detailed dynamics-based algorithm for signed social networks (DBAS) is presented. Simulations on several typical real-world and illustrative networks that have been analyzed by the blockmodel verify the correctness of the proposed algorithm. The efficiency of the algorithm is verified on large scale synthetic networks. © 2015 Elsevier B.V. All rights reserved.
منابع مشابه
Balanced clusters and diffusion process in signed networks
In this paper we study the topology effects on diffusion process in signed networks. Considering a simple threshold model for diffusion process, it is extended to signed networks and some appropriate definitions are proposed. This model is a basic model that could be extended and applied in analyzing dynamics of many real phenomena such as opinion forming or innovation diffusion in social netwo...
متن کاملPrediction and clustering in signed networks: a local to global perspective
The study of social networks is a burgeoning research area. However, most existing work is on networks that simply encode whether relationships exist or not. In contrast, relationships in signed networks can be positive (“like”, “trust”) or negative (“dislike”, “distrust”). The theory of social balance shows that signed networks tend to conform to some local patterns that, in turn, induce certa...
متن کاملModulus Consensus Protocol Design of Discrete-Time Opinion Dynamics on Social Networks Problem description: Opinion dynamics, aiming at describing the evolution of opinions among large populations with social
Opinion dynamics, aiming at describing the evolution of opinions among large populations with social influence, have been widely inspected and a host of models have been reported. However, most of them are considered on cooperative networks which is not the common case because there exist not only cooperative but also antagonistic or competitive relations, e.g., competition between commercial, ...
متن کاملSpectral Analysis of Signed Graphs for Clustering, Prediction and Visualization
We study the application of spectral clustering, prediction and visualization methods to graphs with negatively weighted edges. We show that several characteristic matrices of graphs can be extended to graphs with positively and negatively weighted edges, giving signed spectral clustering methods, signed graph kernels and network visualization methods that apply to signed graphs. In particular,...
متن کاملQuantifying trust dynamics in signed graphs, the S-Cores approach
Lately, there has been an increased interest in signed networks with applications in trust, security, or social computing. This paper focuses on the issue of defining models and metrics for reciprocity in signed graphs. In unsigned directed networks, reciprocity quantifies the predisposition of network members in creating mutual connections. On the other hand, this concept has not yet been inve...
متن کامل